On Convexity of Polynomial Paths and Generalized Majorizations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Convexity of Polynomial Paths and Generalized Majorizations

In this paper we give some useful combinatorial properties of polynomial paths. We also introduce generalized majorization between three sequences of integers and explore its combinatorics. In addition, we give a new, simple, purely polynomial proof of the convexity lemma of E. M. de Sá and R. C. Thompson. All these results have applications in matrix completion theory.

متن کامل

Local Polynomial Convexity

We begin with the following question: given a closed disc D ⋐ C and a complex-valued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? This question is complicated by the presence of points in the surface S := graph D (F) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of contact of the tange...

متن کامل

On Generalized Dyck Paths

We generalize the elegant bijective proof of the Chung Feller theorem from the paper of Young-Ming Chen [The Chung-Feller theorem revisited, Disc. Math. 308 (2008), 1328–1329].

متن کامل

On Generalized Convexity of Nonlinear Complementarity Functions

In this paper, we study some properties of quasiconvex nonlinear complementarity functions. However, we prove that a nonlinear complementarity function cannot be pseudoconvex. As a consequence of this, we show that every convex nonlinear complementarity function is nondifferentiable. Furthermore, some properties of homogeneous nonlinear complementarity functions are proved.

متن کامل

Sum of Squares and Polynomial Convexity

The notion of sos-convexity has recently been proposed as a tractable sufficient condition for convexity of polynomials based on sum of squares decomposition. A multivariate polynomial p(x) = p(x1, . . . , xn) is said to be sos-convex if its Hessian H(x) can be factored as H(x) = M (x) M (x) with a possibly nonsquare polynomial matrix M(x). It turns out that one can reduce the problem of decidi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2010

ISSN: 1077-8926

DOI: 10.37236/333